Resource Allocation on Networks with Separable Concave Functions
نویسندگان
چکیده
منابع مشابه
Efficient Resource Allocation with Non-Concave Objective Functions
We consider resource allocation with separable objective functions defined over subranges of the integers. While it is well known that (the maximization version of) this problem can be solved efficiently if the objective functions are concave, the general problem of resource allocation with non-concave functions is difficult. In this article we show that for fairly well-shaped non-concave objec...
متن کاملBicriteria Resource Allocation Problem in Pert Networks
We develop a bicriteria model for the resource allocation problem in PERT networks, in which the total direct costs of the project as the first objective, and the mean of project completion time as the second objective are minimized. The activity durations are assumed to be independent random variables with either exponential or Erlang distributions, in which the mean of each activity duration ...
متن کاملA New Fairness Index and Novel Approach for QoS-Aware Resource Allocation in LTE Networks Based on Utility Functions
Resource allocation techniques have recently appeared as a widely recognized feature in LTE networks. Most of existing approaches in resource allocation focus on maximizing network’s utility functions. The great potential of utility function in improving resource allocation and enhancing fairness and mean opinion score (MOS) indexes has attracted large efforts over the last few years. In this p...
متن کاملDecomposition of Separable Concave
This paper presents a decomposition scheme for a large class of greyscale structuring elements from mathematical morphology. In contrast with many existing decomposition schemes, our method is valid in the continuous domain. Conditions are given under which this continuous method can be properly discretized. The class of functions that can be decomposed with our method contains the class of qua...
متن کاملResource Allocation Problems with Cost Functions
We study the complexity of a multilateral negotiation framework in which autonomous agents agree in pairs to exchange resources in order to minimise their individual cost. We are interested in establishing whether an allocation of resources that minimises total cost can be reached from an initial allocation in which one agent holds all the resources and one resource is transferred in each contr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 1989
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss1987.109.4_278